Answering Vague Queries in Fuzzy DL-Lite
نویسنده
چکیده
Fuzzy Description Logics (fuzzy DLs) allow to describe structured knowledge with vague concepts. Unlike classical DLs, in fuzzy DLs an answer is a set of tuples ranked according to the degree they satisfy the query. In this paper, we consider fuzzy DL-Lite. We show how to compute efficiently the top-k answers of a complex query (i.e. conjunctive queries) over a huge set of instances.
منابع مشابه
Expressive Querying over Fuzzy DL-Lite Ontologies
Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Description Logics, and also in fDLs, is largely focused on the development of languages where complexity of query answering is as efficient as query answering in data bases. One such example is the DL-Lite language and its fuzzy e...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملA pragmatic approach to answering CQs over fuzzy DL-Lite-ontologies - introducing FLite
Fuzzy Description Logics (FDLs) generalize crisp ones by providing membership degree semantics. To offer efficient query answering for FDLs it is desirable to extend the rewriting-based approach for DL-Lite to its fuzzy variants. For answering conjunctive queries over fuzzy DL-LiteR ontologies we present an approach, that employs the crisp rewriting as a black-box procedure and treats the degre...
متن کاملTowards Top-k Query Answering in Description Logics: The Case of DL-Lite
We address the problem of evaluating ranked top-k queries in description logics. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location” in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge bases.
متن کاملImproving Query Answering over DL-Lite Ontologies
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies with very large instance sets (ABoxes). So far, in DL-Lite systems, this goal has been actually achieved only for relatively simple (short) conjunctive queries. In this paper we present Presto, a new query answering tech...
متن کامل